Minimal strong digraphs
نویسندگان
چکیده
We introduce adequate concepts of expansion of a digraph to obtain a sequential construction of minimal strong digraphs. We obtain a characterization of the class of minimal strong digraphs whose expansion preserves the property of minimality. We prove that every minimal strong digraph of order n > 2 is the expansion of a minimal strong digraph of order n — \ and we give sequentially generative procedures for the constructive characterization of the classes of minimal strong digraphs. Finally we describe algorithms to compute unlabeled minimal strong digraphs and their isospectral classes.
منابع مشابه
Structural and spectral properties of minimal strong digraphs
In this article, we focus on structural and spectral properties of minimal strong digraphs (MSDs). We carry out a comparative study of properties of MSDs versus trees. This analysis includes two new properties. The rst one gives bounds on the coe cients of characteristic polynomials of trees (double directed trees), and conjectures the generalization of these bounds to MSDs. As a particular cas...
متن کاملOn the Energy of Bicyclic Signed Digraphs
Among unicyclic digraphs and signed digraphs with fixed number of vertices, the digraphs and signed digraphs with minimal and maximal energy are already determined. In this paper we address the problem of finding bicyclic signed digraphs with extremal energy. We obtain minimal and maximal energy among all those n -vertex bicyclic signed digraphs which contain vertex-disjoint signed directed cyc...
متن کاملMore skew-equienergetic digraphs
Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this paper, we give some new methods to construct new skew-equienergetic digraphs.
متن کاملLarge Minimal Realizers of a Partial Order
The size of a minimum realizer of a partial order is called the dimension of that partial order. Here we initiate the study of minimal realizers which are not minimum. As an aid to the study of such realizers, we associate to each minimal realizer certain critical digraphs. We characterize all such critical digraphs for the antichain on n elements, and consequently deduce that for n > 4, the ma...
متن کاملOn the structure of strong 3-quasi-transitive digraphs
In this paper, D = (V (D), A(D)) denotes a loopless directed graph (digraph) with at most one arc from u to v for every pair of vertices u and v of V (D). Given a digraph D, we say that D is 3-quasi-transitive if, whenever u → v → w → z in D, then u and z are adjacent. In [3], Bang-Jensen introduced 3-quasi-transitive digraphs and claimed that the only strong 3quasi-transitive digraphs are the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 312 شماره
صفحات -
تاریخ انتشار 2012